Inexact Pattern Matching Algorithms via Automata
نویسنده
چکیده
Pattern matching occurs in various applications, ranging from simple text searching in word processors to identification of common motifs in DNA sequences in computational biology. The problem of exact pattern matching has been well studied and a number of efficient algorithms exist. However these exact pattern matching algorithms are of little help when they are applied to finding patterns in DNA sequences. The DNA sequence search is inheritably inexact in nature because there are acceptable equivalences of amino acids that made up of the sequence. Current inexact pattern matching algorithms are based on four approaches: (1) Dynamic Programming; (2) Automata; (3) Bit-Parallelism; (4) Filtering. This paper serves as an overview of the common existing inexact pattern matching algorithms, with the focus on automata approach.
منابع مشابه
Inexact graph matching by means of estimation of distribution algorithms
Estimation of distribution algorithms (EDAs) are a quite recent topic in optimization techniques. They combine two technical disciplines of soft computing methodologies: probabilistic reasoning and evolutionary computing. Several algorithms and approaches have already been proposed by di8erent authors, but up to now there are very few papers showing their potential and comparing them to other e...
متن کاملExact Analysis of Pattern Matching Algorithms with Probabilistic Arithmetic Automata
We propose a framework for the exact probabilistic analysis of window-based pattern matching algorithms, such as Boyer-Moore, Horspool, Backward DAWG Matching, Backward Oracle Matching, and more. In particular, we show how to efficiently obtain the distribution of such an algorithm’s running time cost for any given pattern in a random text model, which can be quite general, from simple uniform ...
متن کاملAn Algorithm to Compute the Character Access Count Distribution for Pattern Matching Algorithms
We propose a framework for the exact probabilistic analysis of window-based pattern matching algorithms, such as Boyer–Moore, Horspool, Backward DAWG Matching, Backward Oracle Matching, and more. In particular, we develop an algorithm that efficiently computes the distribution of a pattern matching algorithm’s running time cost (such as the number of text character accesses) for any given patte...
متن کاملA missing link in root-to-frontier tree pattern matching
Tree pattern matching (tpm) algorithms play an important role in practical applications such as compilers and XML document validation. Many tpm algorithms based on tree automata have appeared in the literature. For reasons of efficiency, these automata are preferably deterministic. Deterministic root-to-frontier tree automata (drftas) are less powerful than nondeterministic ones, and no root-to...
متن کامل